Human dynamics with limited complexity
نویسندگان
چکیده
منابع مشابه
Descriptional Complexity of Machines with Limited Resources
Over the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of different contexts, our goal here is to provide a survey of these results. Particular emphasis is put on limiting resources (e.g., nondeterminism, ambiguity, lookahead, etc.) for various types of finite state machines, push...
متن کاملUnderstanding the complexity of human gait dynamics.
Time series of human gait stride intervals exhibit fractal and multifractal properties under several conditions. Records from subjects walking at normal, slow, and fast pace speed are analyzed to determine changes in the fractal scalings as a function of the stress condition of the system. Records from subjects with different age from children to elderly and patients suffering from neurodegener...
متن کاملAttitude Dynamics With Limited Verbalisation Capabilities
This article offers a new perspective for research on opinion dynamics. It demonstrates the importance of the distinction of opinion and attitude, which originally has been discussed in literature on consumer behaviour. As opinions are verbalised attitudes not only biases in interpretation and adoption processes have to be considered but also verbalisation biases should be addressed. Such biase...
متن کاملLimited effective reassortment shapes influenza dynamics in a human host
Limited effective reassortment shapes influenza dynamics in a human host Ashley Sobel Leonard, Micah T. McClain, Gavin J. D. Smith, David E. Wentworth, Rebecca A. Halpin, Xudong Lin, Amy Ransier, Timothy B. Stockwell, Suman R. Das, Anthony S. Gilbert, Rob Lambkin-Williams, Geoffrey S. Ginsburg, Christopher W. Woods, Katia Koelle, Christopher J. R. Illingworth6,7∗ 1 Department of Biology, Duke U...
متن کاملState Complexity of Nondeterministic Finite Automata with Limited Nondeterminism
Various approaches of quantifying nondeterminism in nondeterministic finite automata (NFA) are considered. We consider nondeterministic finite automata having finite tree width (ftw-NFA) where the computation on any input string has a constant number of branches. We give effective characterizations of ftw-NFAs and a tight bound for determinizing an ftw-NFA A as a function of the tree width and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel, Emergent and Distributed Systems
سال: 2019
ISSN: 1744-5760,1744-5779
DOI: 10.1080/17445760.2019.1578881